Duality and Convex Programming
نویسندگان
چکیده
This chapter surveys key concepts in convex duality theory and their application to the analysis and numerical solution of problem archetypes in imaging.
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملRobust Duality for Generalized Convex Programming Problems under Data Uncertainty∗
In this paper we present a robust duality theory for generalized convex programming problems in the face of data uncertainty within the framework of robust optimization. We establish robust strong duality for an uncertain nonlinear programming primal problem and its uncertain Lagrangian dual by showing strong duality between the deterministic counterparts: robust counterpart of the primal model...
متن کاملEe 381v: Large Scale Optimization 12.1 Last Time 12.2 Quadratically Constrained Quadratic Program
In the previous lecture, in the first place, we talked about duality for general non-convex optimization. And we know that dual functions are always convex. The dual of the dual problem is also convex. In applications, the dual of the dual can be used as the convex relaxation of the primal (and we will see this explicitly in the next lecture). Then, we covered the concepts of weak duality and s...
متن کاملStrong Duality in Robust Convex Programming: Complete Characterizations
Abstract. Duality theory has played a key role in convex programming in the absence of data uncertainty. In this paper, we present a duality theory for convex programming problems in the face of data uncertainty via robust optimization. We characterize strong duality between the robust counterpart of an uncertain convex program and the optimistic counterpart of its uncertain Lagrangian dual. We...
متن کاملStable Zero Duality Gaps in Convex Programming: Complete Dual Characterisations with Applications to Semidefinite Programs∗
The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite dimensional prob...
متن کامل